A classification of the structures of some Sperner families and superimposed codes
نویسنده
چکیده
In this paper we will give a new proof by using group action to prove the uniqueness of maximal Sperner familiesFmax of [n].We will also prove the uniqueness of Sperner familiesF of [n]with |F|= ( n n2 ) −1 by using a combinatorial approach. Furthermore, by using the uniqueness of Sperner family, we will classify all the structures of (1, 2) superimposed codes of size 9× 10 and 9× 11. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Cover-Free Families and Superimposed Codes: Constructions, Bounds, and Applications to Cryptography and Group Testing
This paper deals with (s, `)-cover-free families or superimposed (s, `)-codes. They generalize the concept of superimposed s-codes and have several applications for cryptography and group testing. We present a new asymptotic bound on the rate of optimal codes and develop some constructions.
متن کاملThe Linear Chromatic Number of Sperner Families
Let S be a set with m elements and S a complete Sperner family on S, i.e. a Sperner family such that every x ∈ S is contained in some member of S. The linear chromatic number of S, defined by Civan, is the smallest integer n with the property that there exists a function f : S → {1, . . . , n} such that if f(x) = f(y), then every set in S which contains x also contains y, or every set in S whic...
متن کاملConvex hulls of more-part Sperner families
The convex hulls of more-part Sperner families is defined and studied. Corollaries of the results are some well-known theorems on 2 or 3-part Sperner families. Some methods are presented giving new theorems.
متن کاملارائه یک الگو برای سیستم ملی طبقه بندی اقدامات پزشکی ایران
Introduction: Health information managers classify the information of health care and treatment on the basis of classifications system of medical procedures, also they analyz the statistical reports on the basis of this arranged information. Today without an efficient and complete medical classification system, it would seem almost impossible to render health care with acceptable quality. With ...
متن کاملAlmost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets
For a set G and a family of sets F let DF (G) = {F ∈ F : F ∩ G = ∅} and SF (G) = {F ∈ F : F ⊆ G or G ⊆ F}. We say that a family is l-almost intersecting, (≤ l)-almost intersecting, l-almost Sperner, (≤ l)-almost Sperner if |DF (F )| = l, |DF (F )| ≤ l, |SF (F )| = l, |SF (F )| ≤ l (respectively) for all F ∈ F . We consider the problem of finding the largest possible family for each of the above...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006